Connected components of irreducible maps and 1D quantum phases
نویسندگان
چکیده
منابع مشابه
Irreducible and connected permutations
A permutation π of [n] = {1, 2, . . . , n} is irreducible if π([m]) = [m] for no m ∈ [n], m < n, and it is connected if for no interval I ⊂ [n], 2 ≤ |I| ≤ n − 1, the image π(I) is an interval. We review enumeration of irreducible permutations and their appearances in mathematics. Then we enumerate connected permutations. Asymptotically, there are n!/e2 of them and exactly (for n > 2) their numb...
متن کاملClassical 1D maps, quantum graphs and ensembles of unitary matrices
We study a certain class of classical one-dimensional piecewise linear maps. For these systems we introduce an infinite family of Markov partitions in equal cells. The symbolic dynamics generated by these systems is described by bi-stochastic (doubly stochastic) matrices. We analyse the structure of graphs generated from the corresponding symbolic dynamics. We demonstrate that the spectra of qu...
متن کاملeffect of seed priming and irrigation regimes on yield,yield components and quality of safflowers cultivars
این مطالعه در سال 1386-87 در آزمایشگاه و مزرعه پژوهشی دانشگاه صنعتی اصفهان به منظور تعیین مناسب ترین تیمار بذری و ارزیابی اثر پرایمینگ بر روی سه رقم گلرنگ تحت سه رژیم آبیاری انجام گرفت. برخی از مطالعات اثرات سودمند پرایمینگ بذر را بر روی گیاهان مختلف بررسی کرده اند اما در حال حاضر اطلاعات کمی در مورد خصوصیات مربوط به جوانه زنی، مراحل نموی، عملکرد و خصوصیات کمی و کیفی بذور تیمار شده ژنوتیپ های م...
Irreducible and Periodic Positive Maps
We extend the notions of irreducibility and periodicity of a stochastic matrix to a unital positive linear map © on a finite-dimensional C∗algebra A and discuss the non-commutative version of the Perron-Frobenius theorem. For a completely positive linear map © with ©(a) = ∑ l Ll ∗aLl, we give conditions on the Ll’s equivalent to irreducibility or periodicity of ©. As an example, positive linear...
متن کاملCounting unlabelled three-connected and homeomorphically irreducible two-connected graphs
A graph will be assumed to be finite and unoriented, with no loops or multiple edges; if multiple edges are to be allowed, the term multigraph will be used. A graph or multigraph. will be called k-connected if at least k vertices and their incident edges must be removed to disconnect it (a complete graph is considered to be k-connected for any k). A block (respectively, multiblock) is a 2-conne...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Mathematical Physics
سال: 2016
ISSN: 0022-2488,1089-7658
DOI: 10.1063/1.4960557